Traditional sufficient conditions for Nash implementation may fail on Internet
نویسنده
چکیده
The Maskin’s theorem is a fundamental work in the theory of mechanism design. In this paper, we propose that if agents report messages to the designer through channels (e.g., Internet), agents can construct a self-enforcing agreement such that any Pareto-inefficient social choice rule satisfying monotonicity and no-veto will not be Nash implementable when an additional condition is satisfied. The key points are: 1) The agreement is unobservable to the designer, and the designer cannot prevent the agents from constructing such agreement; 2) The agents act non-cooperatively, and the Maskin mechanism remain unchanged from the designer’s perspective.
منابع مشابه
A Note on Mixed-Nash Implementation∗
This note considers (complete information) Nash-implementation when mixed strategies are properly accounted for and the outcome space is infinite. We first construct an example in which preferences over lotteries fail the Archemedian axiom and show that, even under the classical sufficient conditions for implementation, the canonical mechanism for implementation fails: there exists a mixed-Nash...
متن کاملSome Limitations of Virtual Bayesian Implementation
Ž Ž .. AS IS WELL KNOWN, Maskin monotonicity Maskin 1977 is a necessary condition for a social choice correspondence to be Nash implementable. In economic environments with at least three agents and a private good, this condition is also sufficient for Nash Ž . Ž . implementation. Remarkably, Abreu and Sen 1991 and Matsushima 1988 showed that this condition can be entirely dispensed with if the...
متن کاملNash equilibrium design and price-based coordination in hierarchical systems
This paper deals with the problem of designing Nash equilibrium points in noncooperative games in which agents anticipate values of Lagrange multipliers coordinating their payoff functions. The addressed model of agents’ interactions, referred to as the price-anticipation game, is studied within the framework of coordination and mechanism design theory for hierarchical systems. Sufficient condi...
متن کاملEquilibria in Bottleneck Games∗
This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension of congestion games by Milchtaich (1996). After characterizing Nash equilibrium of the game, we provide sufficient conditions for which the equivalence between Nash and strong equilibria holds. Somewhat surprisingly, unlike in congestion games, a Nash equilibrium in pure strategies may...
متن کاملA canonical small divisor problem for the Nash-Moser method
In this note we prove a general elementary small divisor theorem for Hs norms of N ×N matrices that provides a potentially useful estimate for expunging resonances in Nash-Moser Newton Iterations. The theorem requires compatibility conditions on the approximating matrices, and we investigate how the theorem can fail when the compatibility conditions are violated. This investigation suggests tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1206.1188 شماره
صفحات -
تاریخ انتشار 2012